Floating-Point Arithmetic Algorithms in the Symmetric Residue Number System

نویسندگان

  • Eisuke Kinoshita
  • Hideo Kosako
  • Yoshiaki Kojima
چکیده

The residue number system is an integer number system and is inconvenient to represent numbers with fractional parts. In the symmetric residue system, a new representation of floating-point numbers and arithmetic algorithms for its addition, subtraction, multiplication, and division are proposed. A floating-point number is expressed as an integer multiplied by a product of the moduli. The proposed system assumes existence of necessary conversion procedures before and after the computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Eigen Decomposition of a Symmetric Matrix in Fixed-point Arithmetic

Since a number of signal processing algorithms requiring the EVD of a symmetric matrix are implemented on fixedpoint DSPs, there is considerable interest in matrix diagonalization algorithms that can be implemented in fixed-point arithmetic. We propose modifications to the Jacobi Cyclic Row algorithm that favor a fixed-point implementation. We then compare the eigenvalues and eigenvectors obtai...

متن کامل

Overflow Detection in Residue Number System, Moduli Set {2n-1,2n,2n+1}

Residue Number System (RNS) is a non-weighted number system for integer number arithmetic, which is based on the residues of a number to a certain set of numbers called module set. The main characteristics and advantage of residue number system is reducing carry propagation in calculations. The elimination of carry propagation leads to the possibility of maximizing parallel processing and reduc...

متن کامل

Fast Dot Product over Finite Field

Finite fields have great applications in various areas as cryptography, that is why it is important to have fast ways of computation to manipulate them. A first approach developed in this report lies in representing integers of the field using floating-point numbers, which lead to efficient computations. Operations in our case are done by restricting the characteristic p of the field to a float...

متن کامل

Low Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System

Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...

متن کامل

Multiply & Accumulate Unit Using RNS Algorithm & Vedic Mathematics: A Review

High speed execution of arithmetic operations and high degree of precision in real time system are of major concern in any digital signal processing (DSP). Speed of DSP depends on speed of multiplier and algorithm used. In this paper we propose Residue Number System method for fast “carry free” floating point arithmetic operations. Floating Point RNS units have obvious advantages over tradition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1974